Enumerating Extreme Points in Higher Dimensions
نویسندگان
چکیده
We consider the problem of enumerating all extreme points of a given set P of n points in d dimensions. We present an algorithm with O(n) space and O(nm) time where m is the number of extreme points of P. We also present an algorithm to compute the depth of each point of the given set of n points in d-dimensions. This algorithm has complexity O(n 2) which signiicantly improves the O(n 3) complexity of the previously best known deterministic algorithm. It also improves the best known randomized algorithm with expected running time
منابع مشابه
A Problem in Enumerating Extreme Points
We describe the central problem in developing an efficient algorithm for enumerating the extreme points of a convex polytope specified by linear constraints, and discuss a conjecture for its solution.
متن کاملSegments in enumerating faces
We introduce the concept of a segment of a degenerate convex polytope specified by a system of linear constraints, and explain its importance in developing algorithms for enumerating the faces. Using segments, we describe an algorithm that enumerates all the faces, in time polynomial in their number. The role of segments in the unsolved problem of enumerating the extreme points of a convex poly...
متن کاملA problem in enumerating extreme points, and an efficient algorithm for one class of polytopes
We consider the problem of developing an efficient algorithm for enumerating the extreme points of a convex polytope specified by linear constraints. Murty and Chung [8] introduced the concept of a segment of a polytope, and used it to develop some steps for carrying out the enumeration efficiently until the convex hull of the set of known extreme points becomes a segment. That effort stops wit...
متن کاملThe Computational Challenge of Enumerating High-Dimensional Rook Walks
We present guesses, based on intensive computer algebra calculations, for recurrence equations of the sequences enumerating rook walks in up to twelve dimensions ending on the main diagonal. Computer proofs can in principle be constructed for all of them. For the moment, however, these computations are feasible only for low dimensions. We pose it as a challenge to develop algorithms which can a...
متن کاملC*-Extreme Points and C*-Faces oF the Epigraph iF C*-Affine Maps in *-Rings
Abstract. In this paper, we define the notion of C*-affine maps in the unital *-rings and we investigate the C*-extreme points of the graph and epigraph of such maps. We show that for a C*-convex map f on a unital *-ring R satisfying the positive square root axiom with an additional condition, the graph of f is a C*-face of the epigraph of f. Moreover, we prove som...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Nord. J. Comput.
دوره 8 شماره
صفحات -
تاریخ انتشار 1995